Language Recognizable in Real Time by Cellular Automata
نویسنده
چکیده
We consider t he language L of the st rings over t he alphabet {a, I} of sha pe x lxl where Ixl is t he length of the st ring x . We show that L is recognized in real t ime by an iterat ive array but not by a one-way cellular auto maton , while the lan guage {O, 1}*· L is recognized in real t ime by a cellula r automato n but not by an iterat ive array.
منابع مشابه
Real-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata
This paper discusses real-time language recognition by 1dimensional one-way cellular automata (OCAs) and two-way cellular automata (CAs), focusing on limitations of the parallel computation power. To clarify the limitations, we investigate real-time recognition of cyclic strings of the form uk with u ∈ {0, 1}+ and k ≥ 2. We show a version of pumping lemma for recognizing cyclic strings by OCAs,...
متن کاملLanguages not recognizable in real time by one-dimensional cellular automata
This paper discusses real-time language recognition by one-dimensional cellular automata (CA), focusing on limitations of the parallel recognition power. We investigate language recognition of strings containing binary representations B(|w|) of their own lengths. It is shown that: (1) The language LX = {w ∈ {0,1}+: w contains the binary number(s) B(|w|)} is recognizable by CA in linear time, bu...
متن کاملRecognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata
A linear-slender context-free language is a context-free language whose number of words of length n is linear in n. Its structure has been finely characterized in a work of Ilie, Rozenberg and Salomaa. Thanks to this characterization, we show that every linear-slender context-free language is recognizable by a real time one-way cellular automaton.
متن کاملL-Convex Polyominoes Are Recognizable in Real Time by 2D Cellular Automata
A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing such polyominoes has been recently proved to be recognizable by tiling systems by S. Brocchi, A. Frosini, R. Pinzani and S. Rinaldi. In an attempt to compare recognition power of tiling systems and cellular automata, we...
متن کاملSeparating Real-Time and Linear Space Recognition of Languages on One-Dimensional Cellular Automata
In this article we will focus on a famous open question about algorithmic complexity classes on one dimensional cellular automata, and we will show that if all problems recognizable in space n (where n is the length of the input) can be recognized in time n then for every space-constructible function f all the problems that are recognizable in space f can be recognized in time f .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 8 شماره
صفحات -
تاریخ انتشار 1994